Three-Dimensional Grid Drawings with Sub-quadratic Volume
نویسندگان
چکیده
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges are pairwise non-crossing. A O(n3/2) volume bound is proved for three-dimensional grid drawings of graphs with bounded degree, graphs with bounded genus, and graphs with no bounded complete graph as a minor. The previous best bound for these graph families was O(n2). These results (partially) solve open problems due to Pach, Thiele, and Tóth [Graph Drawing 1997] and Felsner, Liotta, and Wismath [Graph Drawing 2001].
منابع مشابه
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings with small bounding box volume. Our first main result is that every nvertex graph with bounded degeneracy has a three-dimensional grid drawing with O...
متن کاملJournal of Graph Algorithms and Applications
An exact formula is given for the maximum number of edges in a graph that admits a three-dimensional grid-drawing contained in a given bounding box. The first universal lower bound on the volume of three-dimensional grid-drawings is obtained as a corollary. Our results generalise to the setting of multi-dimensional polyline grid-drawings.
متن کاملPath-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
Straight-Line Grid Drawings of Graphs ? Vida Dujmović1, Pat Morin2, and David R. Wood2 1 School of Computer Science, McGill University, Montréal, Canada. E-mail: vida s.m gill. a 2 School of Computer Science, Carleton University, Ottawa, Canada. E-mail: fmorin,davidwg s s. arleton. a Abstract. We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line grid ...
متن کاملTree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to five, and to five patterns: straight, Y , ψ, X, and full. The ψ–drawings generalize hvor strictly upward drawings to ternary trees. We show that co...
متن کاملThree-dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is shown that for any xed r 2, every r-colorable graph of n vertices has a three-dimensional grid drawing that ts into a box of volume O(n2). The order of magnitude of this bound cannot be improved.
متن کامل